An optimal delay management algorithm from passengers' viewpoints considering the whole railway network
نویسندگان
چکیده
We propose an algorithm for optimal delay management. Delay management means a decision whether or not to keep a connection between trains and is made by dispatchers when trains are delayed. We set dissatisfaction of all passengers in the whole railway network as a criterion and develop an algorithm which seeks for a delay management plan which minimizes passengers’ dissatisfaction. The algorithm is a combination of simulation and optimization. The simulation part consists of a train traffic simulator and a passenger flow simulator which work in parallel. The train traffic simulator forecasts future train diagrams considering the dynamic interaction between trains and passengers. The passenger flow simulator traces behaviour of all the passengers one by one and calculates how many passengers get on/off at each station. This information is given to the train traffic simulator and necessary dwell times are calculated. Passengers’ dissatisfaction is also estimated from the results of the passenger flow simulation. In the optimization part, we use the tabu search algorithm. We will show the details of our algorithm together with numerical results using real world data. 2011 Elsevier Ltd. All rights reserved.
منابع مشابه
On the Impact of Uncertainty on some Optimizaiton Problems: Combinatorial Aspects of Delay Management and Robust Online Scheduling
Real-life optimization problems frequently rely on input data which only estimates the data actually appearing when a computed solution is used in practice. Small deviations of the actual data from the input data can have many different consequences: for instance, a computed solution might need to be adapted in order to guarantee feasibility, or the quality of a computed solution might degrade ...
متن کاملOptimal Path Choice in Railway Passenger Travel Network Based on Residual Train Capacity
Passenger's optimal path choice is one of the prominent research topics in the field of railway passenger transport organization. More and more different train types are available, increasing path choices from departure to destination for travelers are unstoppable. However, travelers cannot avoid being confused when they hope to choose a perfect travel plan based on various travel time and cost...
متن کاملRailway Delay Management: Exploring Its Algorithmic Complexity
We consider delay management in railway systems. Given delayed trains, we want to find a waiting policy for the connecting trains minimizing the weighted total passenger delay. If there is a single delayed train and passengers transfer at most twice along fixed routes, or if the railway network has a tree structure, the problem can be solved by reduction to min-cut problems. For delayed passeng...
متن کاملMulticast computer network routing using genetic algorithm and ant colony
Due to the growth and development of computer networks, the importance of the routing topic has been increased. The importance of the use of multicast networks is not negligible nowadays. Many of multimedia programs need to use a communication link to send a packet from a sender to several receivers. To support such programs, there is a need to make an optimal multicast tree to indicate the opt...
متن کاملParameters Assignment of Electric Train Controller by Using Gravitational Search Optimization Algorithm
The speed profile of the train will be determined according to criteria such as safety, travel convenience, and the type of electric motor used for traction. Due to the passengers and cargo on the train, the electric train load is constantly changing. This will require reassigning the speed controller’s parameters of the electric train. For this purpose, the Gravitational Search optimization Al...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- JRTPM
دوره 1 شماره
صفحات -
تاریخ انتشار 2011